Subdivision Depth Computation for Catmull-Clark Subdivision Surfaces
نویسندگان
چکیده
منابع مشابه
Adaptive Subdivision of Catmull-Clark Subdivision Surfaces
Catmull-Clark subdivision scheme provides a powerful method for building smooth and complex surfaces. But the number of faces in the uniformly refined meshes increases sharply with respect to subdivision depth. This paper presents an adaptive subdivision technique as a solution to this problem. Instead of subdivision depths of mesh faces, the adaptive subdivision process is driven by labels of ...
متن کاملDynamic Catmull-Clark Subdivision Surfaces
Recursive subdivision schemes have been extensively used in computer graphics, computer-aided geometric design, and scientific visualization for modeling smooth surfaces of arbitrary topology. Recursive subdivision generates a visually pleasing smooth surface in the limit from an initial user-specified polygonal mesh through the repeated application of a fixed set of subdivision rules. In this ...
متن کاملMatrix Based Subdivision Depth Computation for Extra-Ordinary Catmull-Clark Subdivision Surface Patches
A new subdivision depth computation technique for extraordinary Catmull-Clark subdivision surface (CCSS) patches is presented. The new technique improves a previous technique by using a matrix representation of the second order norm in the computation process. This enables us to get a more precise estimate of the rate of convergence of the second order norm of an extra-ordinary CCSS patch and, ...
متن کاملSubdivision Depth Computation for Extra-Ordinary Catmull-Clark Subdivision Surface Patches
A second order forward differences based subdivision depth computation technique for extra-ordinary Catmull-Clark subdivision surface (CCSS) patches is presented. The new technique improves a previous technique in that the computation of the subdivision depth is based on the patch’s curvature distribution, instead of its dimension. Hence, with the new technique, no excessive subdivision is need...
متن کاملGeneralized Catmull-Clark Subdivision
The Catmull-Clark subdivision algorithm consists of an operator that can be decomposed into a refinement operator and a successively executed smoothing operator, where the refinement operator splits each face with m vertices into m quadrilateral subfaces and the smoothing operator replaces each internal vertex with an affine combination of its neighboring vertices and itself. Over regular meshe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer-Aided Design and Applications
سال: 2006
ISSN: 1686-4360
DOI: 10.1080/16864360.2006.10738487